A Unified Framework for Emotional Elements Extraction Based on Finite State Matching Machine

نویسندگان

  • Yunzhi Tan
  • Yongfeng Zhang
  • Min Zhang
  • Yiqun Liu
  • Shaoping Ma
چکیده

Traditional methods for sentiment analysis mainly focus on the construction of emotional resources based on the review corpus of specific areas, and use phrase matching technologies to build a list of product feature words and opinion words. These methods bring about the disadvantages of inadequate model scalability, low matching precision, and high redundancy. Besides, it is particularly difficult to deal with negative words. In this work, we designed a unified framework based on finite state matching machine to deal with the problems of emotional element extraction. The max-matching principal and negative words processing can be integrated into the framework naturally. In addition, the framework leverages rule-based methods to filter out illegitimate feature-opinion pairs. Compared with traditional methods, the framework achieves high accuracy and scalability in emotional element extraction. Experimental results show that the extracting accuracy is up to 84%, which has increased by 20% comparing with traditional phrase matching techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Evaluation of Local Detectors in the Presence of Noise for Multi-Sensor Remote Sensing Image Matching

Automatic, efficient, accurate, and stable image matching is one of the most critical issues in remote sensing, photogrammetry, and machine vision. In recent decades, various algorithms have been proposed based on the feature-based framework, which concentrates on detecting and describing local features. Understanding the characteristics of different matching algorithms in various applications ...

متن کامل

A Hybrid Regression Test Selection Technique for Object-Oriented Programs

We propose a regression test selection technique that is based on analysis of both the source code of an object-oriented program as well as the UML state machine models of the affected classes. We first construct a dependency graph model of the original program from the source code. When the program is suitably modified, the constructed model is updated to reflect the changes. Our model in addi...

متن کامل

Finite-State Machines for Mining Patterns in Very Large Text Repositories

The emergence of WWW search engines since the 1990s has changed the scale of many natural language processing applications. Text mining, information extraction and related tasks can now be applied to tens of billions of documents, which sets new efficiency standards for NLP algorithms. Finite-state machines are an obvious choice of a formal framework for such applications. However, the scale of...

متن کامل

Extending Regular Expressions with Context Operators and Parse Extraction

Regular expressions are used in many applications to specify patterns because any regular expression can be compiled into a very efficient one-pass pattern matcher called a finite automaton. Finding matches is useful, but even more useful is parse extraction, which describes in detail how a pattern matches some input. After matching an address, for example, parse extraction makes it easy to fin...

متن کامل

A Unified Model of Phrasal and Sentential Evidence for Information Extraction

Information Extraction (IE) systems that extract role fillers for events typically look at the local context surrounding a phrase when deciding whether to extract it. Often, however, role fillers occur in clauses that are not directly linked to an event word. We present a new model for event extraction that jointly considers both the local context around a phrase along with the wider sentential...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013